Searching the k-change neighborhood for TSP is W[1]-hard
نویسنده
چکیده
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete search (modulo some complexitytheoretic assumptions).
منابع مشابه
Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملQuantum Inspired General Variable Neighborhood Search (qGVNS) for dynamic garbage collection
General Variable Neighborhood Search (GVNS) is a well known and widely used 1 metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum 2 General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the 3 conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates 4 tools and techniques from...
متن کاملDeterministic Algorithms for Multi-criteria TSP
We present deterministic approximation algorithms for the multi-criteria traveling salesman problem (TSP). Our algorithms are faster and simpler than the existing randomized algorithms. First, we devise algorithms for the symmetric and asymmetric multicriteria Max-TSP that achieve ratios of 1/2k − ε and 1/(4k − 2) − ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملAfrl-afosr-va-tr-2015-0320 Exploiting Elementary Landscapes for Tsp, Vehicle Routing and Scheduling
There are a number of NP-hard optimization problems where the search space can be characterized as an elementary landscape. For these search spaces the evaluation function is an eigenfunction of the Laplacian matrix that describes the neighborhood structure of the search space. Problems such as the Traveling Salesman Problem (TSP), Graph Coloring, the Frequency Assignment Problem, as well as Mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008